Permutation codes with specified packing radius

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A random construction for permutation codes and the covering radius

Weanalyse a probabilistic argument that gives a semi-random construction for a permutation code on n symbols with distance n− s and size (s!(log n)1/2), and a bound on the covering radius for sets of permutations in terms of a certain frequency parameter.

متن کامل

Graphs with specified radius and diameter

The radius and diameter of a graph are known to satisfy the relation rad G < diam C 5 2 rad G. We show that this is the only restriction on these parameters and construl*t all nonisomorphic graphs of minimal order having a specified radius and diameter. In a graph G the diameter is diam G = ma,\_inax, d(tc, u) and the radius is rad G = min, max, d(tl, u), the min and max being taken over all po...

متن کامل

Permutation codes

There are many analogies between subsets and permutations of a set, and in particular between sets of subsets and sets of permutations. The theories share many features, but there are also big differences. This paper is a survey of old and new results about sets (and groups) of permutations, concentrating on the analogies and on the relations to coding theory. Several open problems are describe...

متن کامل

Remoteness of permutation codes

Let X be a finite set of ‘points’ and d be a metric on X which takes integral values. For any v ∈ X and t ≥ 0, we refer to the set Bt(v) = {u ∈ X : d(u, v) ≤ t} as the ball of radius t centered at v, and we denote the minimum (maximum, respectively) volume of a ball with radius t in X as V min t (V max t ). Let C ⊆ X, C 6= ∅ be a code, i.e. a set of points, which we will refer to as codewords. ...

متن کامل

Frame Expansions Quantized with Permutation Codes

Quantized frame expansions are overcomplete representations of signals approximated by some quantizer. This scheme proved to be a very useful tool to combat quantization noise and erasures. Normally, a scalar quantizer is used in the quantization phase. In this paper we investigate the use of permutation codes, a beautiful source coding technique, as a quantizer. We explore consistent reconstru...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2012

ISSN: 0925-1022,1573-7586

DOI: 10.1007/s10623-012-9623-4